The QR Algorithm and Hyman ' s Method on Vector Computers
نویسنده
چکیده
The implementation on vector computers of the QR algorithm and of iterative schemes based on obtaining the determinant and its derivatives by Hyman's method are presented. It is shown that iterative schemes based on Hyman's method will probably be more efficient than the QR algorithm on vector computers for large matrices. A theoretical comparison of the Laguerre iterative scheme with the QR algorithm is presented using the latest available CDC STAR-100 instruction execution times. In addition, the results of several test cases run on the Laguerre-Hyman algorithm on a serial computer are reported.
منابع مشابه
Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
The Arnoldi process is a well known technique for approximating a few eigenvalues and corresponding eigenvectors of a general square matrix. Numerical difficulties such as loss of orthogonality and assessment of the numerical quality of the approximations as well as a potential for unbounded growth in storage have limited the applicability of the method. These issues are addressed by fixing the...
متن کاملParallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers
This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملA Generalized Gram{schmidt Procedure for Parallel Applications
The Gram-Schmidt procedure is used to orthogonalize one vector against a set of vectors or to construct a QR factorization of a matrix. In the Classical Gram-Schmidt algorithm (CGS), orthogonal vectors are produced via matrix{vector updates, which is desirable for parallel computers. Unfortunately, this algorithm exhibits a poor numerical stability behavior and the loss of orthogonality cannot ...
متن کاملOrthogonal Reduction on Vector Computers
This paper concerns the implementation of the QR factorization by Givens and Householder transformations on vector computers . Following the analysis of Dongarra, et al. [1984] for Gaussian elimination, various ijk forms for both Givens and Householder transformations are investigated. Conclusions concerning which of these forms have desirable or undesirable properties for vector computers are ...
متن کامل